Separating a Superclass of Comb Inequalities in Planar Graphs

نویسنده

  • Adam N. Letchford
چکیده

Many classes of valid and facet-inducing inequalities are known for the family of polytopes associated with the Symmetric Travelling Salesman Problem (STSP), including subtour elimination, 2-matching and comb inequalities. For a given class of inequalities, an exact separation algorithm is a procedure which, given an LP relaxation vector x∗, 7nds one or more inequalities in the class which are violated by x∗, or proves that none exist. Such algorithms are at the core of the highly successful branch-and-cut algorithms for the STSP. However, whereas polynomial time exact separation algorithms are known for subtour elimination and 2-matching inequalities, the complexity of comb separation is unknown. A partial answer to the comb problem is provided in this paper. We de7ne a generalization of comb inequalities and show that the associated separation problem can be solved e:ciently when the subgraph induced by the edges with x∗ e ¿0 is planar. The separation algorithm runs in O(n3) time, where n is the number of vertices in the graph.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Generalized Domino-Parity Inequalities for the Symmetric Traveling Salesman Problem

We extend the work of Letchford [Letchford, A. N. 2000. Separating a superclass of comb inequalities in planar graphs. Math. Oper. Res. 25 443–454] by introducing a new class of valid inequalities for the traveling salesman problem, called the generalized domino-parity (GDP) constraints. Just as Letchford’s domino-parity constraints generalize comb inequalities, GDP constraints generalize the m...

متن کامل

Separating Maximally Violated Comb Inequalities in Planar Graphs

The Traveling Salesman Problem (TSP) is a benchmark problem in combinatorial optimization. It was one of the very rst problems used for developing and testing approaches to solving large integer programs, including cutting plane algorithms and branch-and-cut algorithms. Much of the research in this area has been focused on nding new classes of facets for the TSP polytope, and much less attentio...

متن کامل

Separating Simple Domino Parity Inequalities

In IPCO 2002, Letchford and Lodi describe an algorithm for separating simple comb inequalities that runs in O(nm log n) time, where n and m are respectively the number of nodes and arcs in the support graph of the point to be separated. In this extended abstract, we demonstrate that the above algorithm separates over a superclass of simple comb inequalities, which we call simple domino parity i...

متن کامل

A Study of Domino-Parity and k-Parity Constraints for the TSP

Letchford (2000) introduced the domino-parity inequalities for the symmetric traveling salesman problem and showed that if the support graph of an LP solution is planar, then the separation problem can be solved in polynomial time. We generalize domino-parity inequalities to multi-handled configurations, introducing a superclass of bipartition and star inequalities. Also, we generalize Letchfor...

متن کامل

Polynomial-Time Separation of a Superclass of Simple Comb Inequalities

The comb inequalities are a well-known class of facet-inducing inequalities for the Traveling Salesman Problem, defined in terms of certain vertex sets called the handle and the teeth. We say that a comb inequality is simple if the following holds for each tooth: either the intersection of the tooth with the handle has cardinality one, or the part of the tooth outside the handle has cardinality...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Math. Oper. Res.

دوره 25  شماره 

صفحات  -

تاریخ انتشار 2000